5 results
A decision procedure using the geometry of convex sets
- Part of
-
- Journal:
- Mathematika / Volume 21 / Issue 2 / December 1974
- Published online by Cambridge University Press:
- 26 February 2010, pp. 199-206
- Print publication:
- December 1974
-
- Article
- Export citation
Patrick C. Fischer. On formalisms for Turing machines. Journal of the Association for Computing Machinery, vol. 12 (1965), pp. 570–580. - Stål Aanderaa and Patrick C. Fischer. The solvability of the halting problem for 2-state Post machines. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 677–682. - Patrick C. Fischer. Quantificational variants on the halting problem for Turing machines. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 15 (1969), pp. 211–218.
-
- Journal:
- The Journal of Symbolic Logic / Volume 36 / Issue 3 / September 1971
- Published online by Cambridge University Press:
- 12 March 2014, pp. 532-534
- Print publication:
- September 1971
-
- Article
- Export citation
Philip K. Hooper. The undecidability of the Turing machine immortality problem. The journal of symbolic logic, vol. 31 (1966), pp. 219–234.
-
- Journal:
- The Journal of Symbolic Logic / Volume 36 / Issue 1 / March 1971
- Published online by Cambridge University Press:
- 12 March 2014, p. 150
- Print publication:
- March 1971
-
- Article
- Export citation
A simple solution of the uniform halting problem1
-
- Journal:
- The Journal of Symbolic Logic / Volume 34 / Issue 4 / February 1970
- Published online by Cambridge University Press:
- 12 March 2014, pp. 639-640
- Print publication:
- February 1970
-
- Article
- Export citation
The unsolvability of the uniform halting problem for two state Turing machines
-
- Journal:
- The Journal of Symbolic Logic / Volume 34 / Issue 2 / 25 July 1969
- Published online by Cambridge University Press:
- 12 March 2014, pp. 161-165
- Print publication:
- 25 July 1969
-
- Article
- Export citation